Distributed mutual exclusion on a ring of processes
نویسندگان
چکیده
منابع مشابه
Distributed Mutual Exclusion Algorithms on a Ring of Clusters
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms. Each node on the ring represents a cluster of nodes and implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents. We show the implementation of Ricart-Agrawala and a Tokenbased algorithm on this architecture. The message complexities ...
متن کاملA Simulation Study on Distributed Mutual Exclusion
In the problem of mutual exclusion concurrent access to a shared resource using a struc tural program abstraction called a Critical Section CS must be synchronized such that at any time only one process can enter the CS In a distributed system due to the lack of both a shared memory and a global clock and due to unpredictable message delay the design of a distributed mutual exclusion algorithm ...
متن کاملDistributed Mutual Exclusion Based on Causal Ordering
Problem statement: Causality among events, more formally the causal ordering relation, is a powerful tool for analyzing and drawing inferences about distributed systems. The knowledge of the causal ordering relation between processes helps designers and the system itself solve a variety of problems in distributed systems. In distributed algorithms design, such knowledge helped ensure fairness a...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملA Distributed K-Mutual Exclusion Algorithm
This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1985
ISSN: 0167-6423
DOI: 10.1016/0167-6423(85)90015-2